An Arnoldi-type Algorithm for Computing Page Rank
نویسندگان
چکیده
We consider the problem of computing PageRank. The matrix involved is large and cannot be factored, and hence techniques based on matrix-vector products must be applied. A variant of the restarted refined Arnoldi method is proposed, which does not involve Ritz value computations. Numerical examples illustrate the performance and convergence behavior of the algorithm. AMS subject classification (2000): 65F15, 65C40.
منابع مشابه
A rank-exploiting infinite Arnoldi algorithm for nonlinear eigenvalue problems
We consider the nonlinear eigenvalue problem: M(λ)x = 0, where M(λ) is a large parameter-dependent matrix. In several applications, M(λ) has a structure where the higher-order terms of its Taylor expansion have a particular low-rank structure. We propose a new Arnoldi based algorithm that can exploit this structure. More precisely, the proposed algorithm is equivalent to Arnoldi’s method applie...
متن کاملMultigrid Arnoldi for Eigenvalues
A new approach is given for computing eigenvalues and eigenvectors of large matrices. Multigrid is combined with the Arnoldi method in order to solve difficult problems. First, a two-grid method computes eigenvalues on a coarse grid and improves them on the fine grid. On the fine grid, an Arnoldi-type method is used that, unlike standard Arnoldi methods, can accept initial approximate eigenvect...
متن کاملA Parallel Davidson-Type Algorithm for Several Eigenvalues
In this paper we propose a new parallelization of the Davidson algorithm adapted for many eigenvalues. In our parallelization we use a relationship between two consecutive subspaces which allows us to calculate eigenvalues in the subspace through an arrowhead matrix. Theoretical timing estimates for the parallel algorithm are developed and compared against our numerical results on the Paragon. ...
متن کاملComputing a Partial Schur Factorization of Nonlinear Eigenvalue Problems Using the Infinite Arnoldi Method
The partial Schur factorization can be used to represent several eigenpairs of a matrix in a numerically robust way. Different adaptions of the Arnoldi method are often used to compute partial Schur factorizations. We propose here a technique to compute a partial Schur factorization of a nonlinear eigenvalue problem (NEP). The technique is inspired by the algorithm in [8], now called the infini...
متن کاملPolynomial Acceleration for Restarted Arnoldi Iteration and its Parallelization
We propose an accelerating method for the restarted Arnoldi iteration to compute a number of eigenvalues of the standard eigenproblem Ax = x and discuss the dependence of the convergence rate of the accelerated iteration on the distribution of spectrum. The e ectiveness of the approach is proved by numerical results. We also propose a new parallelization technique for the nonsymmetric double sh...
متن کامل